Fast, Parallel Watershed Algorithm Based on Path Tracing
نویسندگان
چکیده
In this paper a fast, parallel watershed algorithm for segmentation of digital grey-scale images is presented. We show an original parallelisation technique based on the ”shared nothing” principle and its application to a modified path-tracing watershed algorithm, which allows a vast majority of computations to be broken up into several independent tasks that can be run in parallel on different processing nodes. This approach eliminates the need of any complex synchronization between the threads and translates to a very high efficiency and speed of the algorithm. Sample results are discussed, with emphasis on their correctness and execution times.
منابع مشابه
Near-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملParallel X-Fault Simulation with Critical Path Tracing
In this paper, a new very fast fault simulation method to handle the X-fault model is proposed. The method is based on a two-phase procedure. In the first phase, a parallel exact critical path fault tracing is used to determine all the detected stuck-at faults in the circuit, and in the second phase a postprocess is launched which will determine the detectability of X-faults. Keywords-digital c...
متن کاملA 3D Curvilinear Skeletonization Algorithm with Application to Path Tracing
We present a novel 3D curvilinear skeletonization algorithm which produces filtered skeletons without needing any user input, thanks to a new parallel algorithm based on the cubical complex framework. These skeletons are used in a modified path tracing algorithm in order to produce less noisy images in less time than the classical approach.
متن کاملOptimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm
Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...
متن کاملAutonomous Parallel Parking of a Car Based on Parking Space Detection and Fuzzy Controller
This paper develops an automatic parking algorithm based on a fuzzy logic controller with the vehicle pose for the input and the steering angle for the output. In this way some feasible reference trajectory path have been introduced according to geometric and kinematic constraints and nonholonomic constraints to simulate motion path of car. Also a novel method is used for parking space detec...
متن کامل